A formalised first-order confluence proof for the -calculus using one-sorted variable names
نویسندگان
چکیده
Reasoning Administrative Proof Layer
منابع مشابه
The Primitive Proof Theory of the lambda-Calculus
We consider formal provability with structural induction and related proof principles in the λ-calculus seen as a (functional) programming language, i.e., presented with first-order abstract syntax over one-sorted variable names. Structural induction is the principal primitive proof principle of that particular syntactic framework and it is, indeed, near-ubiquitously employed in informal proofs...
متن کاملThe Mechanisation of Barendregt-Style Equational Proofs (the Residual Perspective)
We show how to mechanise equational proofs about higher-order languages by using the primitive proof principles of first-order abstract syntax over one-sorted variable names. We illustrate the method here by proving (in Isabelle/HOL) a technical property which makes the method widely applicable for the λ-calculus: the residual theory of β is renaming-free up-to an initiality condition akin to t...
متن کاملUniversity of Edinburgh Division of Informatics
We present the Isabelle/HOL formalisation of some key equa-tional properties of the untyped λ-calculus with one-sorted variable names. Existing machine formalisations of λ-calculus proofs typically rely on alternative representations and/or proof principles to facilitate mechanization and we briefly account for these works. Our own development remains faithful to the standard textbook presentat...
متن کاملStructural Induction and the λ-Calculus
We consider formal provability with structural induction and related proof principles in the λ-calculus presented with first-order abstract syntax over onesorted variable names. As well as summarising and elaborating on earlier, formally verified proofs (in Isabelle/HOL) of the relative renaming-freeness of βresidual theory and β-confluence, we also present proofs of η-confluence, βη-confluence...
متن کاملBridging de Bruijn Indices and Variable Names in Explicit Substitutions Calculi
Calculi of explicit substitutions have almost always been presented using de Bruijn indices with the aim of avoiding α-conversion and being as close to machines as possible. De Bruijn indices however, though very suitable for the machine, are difficult to human users. This is the reason for a renewed interest in systems of explicit substitutions using variable names. We believe that the study o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Comput.
دوره 183 شماره
صفحات -
تاریخ انتشار 2003